Minimum Perimeter-Sum Partitions in the Plane
نویسندگان
چکیده
منابع مشابه
Minimum Perimeter-Sum Partitions in the Plane
Let P be a set of n points in the plane. We consider the problem of partitioning P into two subsets P1 and P2 such that the sum of the perimeters of ch(P1) and ch(P2) is minimized, where ch(Pi) denotes the convex hull of Pi. The problem was first studied by Mitchell and Wynters in 1991 who gave an O(n2) time algorithm. Despite considerable progress on related problems, no subquadratic time algo...
متن کاملLeast - Perimeter Partitions of the Sphere
We consider generalizations of the honeycomb problem to the sphere S and seek the perimeter-minimizing partition into n regions of equal area. We provide a new proof of Masters’ result that three great semicircles meeting at the poles at 120 degrees minimize perimeter among partitions into three equal areas. We also treat the case of four equal areas, and we prove under various hypotheses that ...
متن کاملMinimum-perimeter enclosures
We give the first polynomial-time algorithm for the problem of finding a minimumperimeter k-gon that encloses a given n-gon. Our algorithm is based on a simple structural result, that an optimal k-gon has at least one “flush” edge with the ngon. This allows one to reduce the problem to computing the shortest k-link path in a simple polygon. As a by-product we observe that the minimum-perimeter ...
متن کاملPlane Partitions
Throughout our study of the enumeration of plane partitions we make use of bijective proofs to find generating functions. In particular, we consider bounded plane partitions, symmetric plane partitions and weak reverse plane partitions. Using the combinatorial interpretations of Schur functions in relation to semistandard Young tableaux, we rely on the properties of symmetric functions. In our ...
متن کاملCounting polyominoes with minimum perimeter
The number of essentially different square polyominoes of order n and minimum perimeter p(n) is enumerated.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 2019
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-019-00059-0